Adaptive strategies for route selection en-route in transportation networks

نویسندگان

چکیده

We examine adaptive strategies adopted by vehicles for route selection en-route in transportation networks. By studying a model of two-dimensional cellular automata, we characterized parameter called path-greediness, which corresponds to the tendency them travel their destinations via shortest path. The path-greediness each individual vehicle is updated based on local traffic conditions, either keep travels shorter path an un-congested region or explore longer diverted paths congested region. found that optimal number steps trigger update dependent density vehicles, and magnitude increment affects macroscopic conditions system. To better coordinate denser networks, should be gradual less frequent.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Route Planning in Transportation Networks

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while ...

متن کامل

Advanced Route Planning in Transportation Networks

Many interesting route planning problems can be solved by computing shortest paths in a suitably modeled, weighted graph representing a transportation network. Such networks are naturally road networks or timetable networks of public transportation. For large networks, the classical Dijkstra algorithm to compute shortest paths is too slow. And therefore have faster algorithms been developed in ...

متن کامل

Evolutionary design of en-route caching strategies

Nowadays, large distributed databases are commonplace. Client applications increasingly rely on accessing objects from multiple remote hosts. The Internet itself is a huge network of computers, sending documents point-to-point by routing packetized data over multiple intermediate relays. As hubs in the network become overutilized, slowdowns and timeouts can disrupt the process. It is thus worth...

متن کامل

Adaptive Route Selection Policy Based on Back Propagation Neural Networks

One of the key issues in the study of multiple route protocols in mobile ad hoc networks (MANETs) is how to select routes to the packet transmission destination. There are currently two route selection methods: primary routing policy and load-balancing policy. Many ad hoc routing protocols are based on primary (fastest or shortest but busiest) routing policy from the self-standpoint of traffic ...

متن کامل

Optimal Route Selection for Autonomous Vehicle Public Transportation System

Wireless Sensor Networks in VANETs and how they have to exchange the traffic information among vehicles in order to achieve seamless service extensions due to unpredictable requests and broadcast chains in the network. To function this there are two possible approaches the push model and other is pull model. The goal of the data push communication model is to exchange information about the posi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chinese Journal of Physics

سال: 2021

ISSN: ['0577-9073', '2309-9097']

DOI: https://doi.org/10.1016/j.cjph.2021.07.024